#include<bits/stdc++.h>
using namespace std;

int a[100005];
priority_queue<int,vector<int>,greater<int> > q;
int main() {
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    sort(a+1,a+n+1);
    int ans=0;
    for(int i=1;i<=n;i++) {
        if(!q.empty()&&q.top()<a[i]) {
            ans++;
            q.pop();
        }
        q.push(a[i]);
    }
    cout<<n-ans;
    return 0;
}